Orthogonal matchings revisited
نویسندگان
چکیده
منابع مشابه
Triangle-Free 2-Matchings Revisited
A 2-matching in an undirected graph G = (V G,EG) is a function x : EG → {0, 1, 2} such that for each node v ∈ V G the sum of values x(e) on all edges e incident to v does not exceed 2. The size of x is the sum ∑ e x(e). If {e ∈ EG | x(e) 6= 0} contains no triangles then x is called triangle-free. Cornuéjols and Pulleyblank devised a combinatorial O(mn)-algorithm that finds a triangle free 2-mat...
متن کاملOrthogonal Persistence Revisited
The social and economic importance of large bodies of programs and data that are potentially long-lived has attracted much attention in the commercial and research communities. Here we concentrate on a set of methodologies and technologies called persistent programming. In particular we review programming language support for the concept of orthogonal persistence, a technique for the uniform tr...
متن کاملOdd minimum cut sets and b-matchings revisited
The famous Padberg–Rao separation algorithm for b-matching polyhedra can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time in the uncapacitated case, and in O(|V ||E|2 log (|V |2/|E|)) time in the capacitated case. We give a new and simple algorithm for the capacitated case which can be implemented to run in O(|V |2|E| log(|V |2/|E|)) time.
متن کاملConfluence of Orthogonal Nominal Rewriting Systems Revisited
Nominal rewriting systems (Fernández, Gabbay & Mackie, 2004; Fernández & Gabbay, 2007) have been introduced as a new framework of higher-order rewriting systems based on the nominal approach (Gabbay & Pitts, 2002; Pitts, 2003), which deals with variable binding via permutations and freshness conditions on atoms. Confluence of orthogonal nominal rewriting systems has been shown in (Fernández & G...
متن کاملMaximum matchings in sparse random graphs: Karp-Sipser revisited
We study the average performance of a simple greedy algorithm for nding a matching in a sparse random graph G n;c=n , where c > 0 is constant. The algorithm was rst proposed by Karp and Sipser 12]. We give signiicantly improved estimates of the errors made by the algorithm. For the sub-critical case where c < e we show that the algorithm nds a maximum matching with high probability. If c > e th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2015
ISSN: 0012-365X
DOI: 10.1016/j.disc.2015.05.009